Chunk: A Framework for Modular Distributed Shared Memory Systems

نویسندگان

  • Alexandra Fedorova
  • Eben Scanlon
چکیده

We present Chunk, a framework for building modular distributed shared memory systems for UNIX. Chunk allows applications that are designed to share local memory through the UNIX memory mapped file mechanism (mmap) to be able to share memory across different physical hosts without modifications. Chunk’s modular architecture enables the use of a variety of memory-sharing policies. We present a DSM system implemented using the Chunk framework and evaluate its performance. We demonstrate the viability of our framework for real-world applications by presenting experiments with Berkeley DB.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation of Loop Scheduling Algorithms on DistributedMemory Systems

Loops are the largest source of parallelism in many applications. All prior DOALL loop scheduling algorithms such as Self-Scheduling, Guided Self-Scheduling, Trapezoid Self-Scheduling, and Factoring try to achieve workload balance through decreasing chunk sizes. Moreover, they have been analyzed only for shared memory platforms. In this work, the prior loop scheduling methods will be evaluated ...

متن کامل

Hierarchical Work Stealing on Manycore Clusters

Partitioned Global Address Space languages like UPC offer a convenient way of expressing large shared data structures, especially for irregular structures that require asynchronous random access. But the static SPMD parallelism model of UPC does not support divide and conquer parallelism or other forms of dynamic parallelism. We introduce a dynamic tasking library for UPC that provides a simple...

متن کامل

Parallel Loop Scheduling Approaches for Distributed and Shared Memory Systems

In this paper, we propose different approaches for the parallel loop scheduling problem on distributed as well as shared memory systems. Specifically, we propose adaptive loop scheduling models in order to achieve load balancing, low runtime scheduling, low synchronization overhead and low communication overhead. Our models are based on an adaptive determination of the chunk size and an exploit...

متن کامل

Efficient Coherency and Synchronization Management in SCI based DSM systems

The performance of shared memory applications on Distributed Shared Memory (DSM) depends to a great part on the existence of efficient synchronization mechanisms and relaxed consistency models with a small management overhead. Using some of the core features of SCI, remote memory access and atomic transactions, highly efficient solutions for these areas have been developed and implemented withi...

متن کامل

Parallelizing Irregular Applications through the YAPPA Compilation Framework

Modern High Performance Computing (HPC) clusters are composed of hundred of nodes integrating multicore processors with advanced cache hierarchies. These systems can reach several petaflops of peak performance, but are optimized for floating point intensive applications, and regular, localizable data structures. The network interconnection of these systems is optimized for bulk, synchronous tra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002